Robert S. P. Beekes (* 2. 9. 1937 – † 21. 9. 2017)
نویسندگان
چکیده
منابع مشابه
2 0 - 2 6 , 1 9 9 9 , p p . 2 8 5 - 2 9 2 . Memory - Based Morphological
We present a general architecture for eecient and deterministic morphological analysis based on memory-based learning, and apply it to morphological analysis of Dutch. The system makes direct mappings from letters in context to rich categories that encode morphological boundaries, syntactic class labels, and spelling changes. Both precision and recall of labeled morphemes are over 84% on held-o...
متن کاملmf • P , 9 , u , P , 9 , 9 x ' ' Us ' Usb ' • Pm ; s GPa
Shock compression data are reported for hot-pressed Bamble bronzite (En86) loaded to pressures between 104 and 161 GPa. When compared to earlier shock wave data on En90 at lower pressures and to static compression data, our data require the presence of a phase change. In space the data yield two distinct trajectories, which cannot be explained by experimental error. The higher-density data, cor...
متن کاملCancer Immunity (9 March 2009) Vol. 9, p. 2
Polymorphonuclear neutrophils (PMNs) are potent effectors of inflammation and their attempts to respond to cancer are suggested by their systemic, regional and intratumoral activation. We previously reported on the recruitment of CD11b+ leukocytes due to tumor site-specific enrichment of TNF activity after intravenous administration of a dimeric TNF immunokine with specificity for fibroblast ac...
متن کامل2017 Lecture 4 : October 9 , 2017
We consider a set of random variables in a particular relationship and its consequences for mutual information. An ordered tuple of random variables (X, Y, Z) is said to form a Markov chain, written as X → Y → Z, if X and Z are independent conditioned on Y. Here, we can think of Y as being sampled given the knowledge of X, and Z being sampled given the knowledge of Y (but not using the “history...
متن کاملp t . 5 - 1 0 , 1 9 9 9 , p p . 2 1 2 3 - 2 1 2 6 . MACHINE LEARNING OF WORD PRONUNCIATION : THE CASE AGAINSTABSTRACTIONBertjan
Word pronunciation can be learned by inductive machine learning algorithms when it is represented as a classiication task: classify a letter within its local word context as mapping to its pronunciation. On the basis of generalization accuracy results from empirical studies, we argue that word pronunciation, particularly in complex spelling systems such as that of En-glish, should not be modell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linguistica Brunensia
سال: 2018
ISSN: 1803-7410,2336-4440
DOI: 10.5817/lb2018-2-6